RNGzip uses a Relax NG schema validator to build a deterministic tree automaton from the specified schema. RNGzip使用RelaxNG模式验证程序从指定的模式构建确定性树自动机。
As discussed last month, I plan to use Deterministic Finite Automaton ( DFA) to compile the proxy. 如上个月所讨论的,我计划用确定性有限自动机(DeterministicFiniteAutomaton,DFA)来编译该代理。
In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA. 在上一篇专栏文章中,我们编写了在所谓的“确定性有限自动机(DeterministicFiniteAutomaton或简称DFA)”中编译一组XPath的逻辑。
Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton ( DFA). 讲得更具体些,在上篇专栏文章中,我回顾了编译所谓“确定性有限自动机(DeterministicFiniteAutomaton,简称DFA)”的一些算法。
Incremental Construction of Minimal Acyclic Deterministic Fuzzy Finite Automaton Designing DSS With a Structured Methodology 增加结构非循环模糊自动机最小化算法(英文)设计决策支持系统的一种结构化方法
In this paper, it is mainly discussed a finite-state deterministic fuzzy automaton ( FDA), which is not only equivalent to corresponding fuzzy language and is also equally powerful as other automata. 作者讨论了有限态确定模糊自动机FDA与它相应的模糊语言以及FDA与其它自动机的等价性。
Non-deterministic finite automaton is translated into deterministic finite automaton. 一般非确定有限自动机转化为确定的有限自动机,其时间复杂度是指数函数级。
This paper makes some studied in the building of Chinese character input modes based on automata theoretic, handles the control operation in the input model, and introduces the concepts of two-way deterministic Chinese finite automaton and two-way nondeterministic Chinese finite automaton. 本文从自动机理论的角度对汉字输入的数学模型进行了研究,把控制操作引入了输入模型,并给出确定汉字双向有穷自动机和不确定汉字双向有穷自动机的模型。
Especially, the deterministic finite-state automaton ( DFA)( i.e. deterministic device) will not be effective for processing the thing when the signal is continuously various or ambiguous in various states. 尤其是当信号飘移不定或模糊不清处于多种变状态时,通常采用的确定有限态自动机(即确定自动装置)进行处理将失去作用。